Characteristic Points of Recursive Systems

نویسندگان

  • Jason P. Bell
  • Stanley Burris
  • Karen A. Yeats
چکیده

Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when working with multi-equation recursive systems. Given an irreducible non-negative power series system with m equations, let ρ be the radius of convergence of the solution power series and let τ be the values of the solution series evaluated at ρ. The main results of the paper include: (a) the set of characteristic points form an antichain in Rm+1, (b) given a characteristic point (a,b), (i) the spectral radius of the Jacobian of G at (a,b) is > 1, and (ii) it is = 1 iff (a,b) = (ρ,τ ), (c) if (ρ,τ ) is a characteristic point, then (i) ρ is the largest a for (a,b) a characteristic point, and (ii) a characteristic point (a,b) with a = ρ is the extreme point (ρ,τ ).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 90 5 . 25 85 v 1 [ m at h . C O ] 1 5 M ay 2 00 9 CHARACTERISTIC POINTS OF RECURSIVE SYSTEMS

Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when working with multi-equation recursive systems.

متن کامل

Monodromy problem for the degenerate critical points

For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...

متن کامل

AIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems

The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...

متن کامل

A Recursive Approximation Approach of non-iid Lognormal Random Variables Summation in Cellular Systems

Co-channel interference is a major factor in limiting the capacity and link quality in cellular communications. As the co-channel interference is modeled by lognormal distribution, sum of the co-channel interferences of neighboring cells is represented by the sum of lognormal Random Variables (RVs) which has no closed-form expression. Assuming independent, identically distributed (iid) RVs, the...

متن کامل

Characteristic Formulae for Fixed-Point Semantics: A General Framework

The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proofs of correctness have been developed independently, but have a common underlying structure. This ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2010